#include <bits/stdc++.h>

#define eb emplace_back
#define ep emplace
#define fi first
#define se second
#define in read<int>()
#define lin read<ll>()
#define rep(i, x, y) for(int i = (x); i <= (y); i++)
#define per(i, x, y) for(int i = (x); i >= (y); i--)

using namespace std;

using ll = long long;
using db = double;
using pii = pair < int, int >;
using vec = vector < int >;
using veg = vector < pii >;

template < typename T > T read() {
	T x = 0; bool f = 0; char ch = getchar();
	while(!isdigit(ch)) f |= ch == '-', ch = getchar();
	while(isdigit(ch)) x = x * 10 + (ch ^ 48), ch = getchar();
	return f ? -x : x;
}

template < typename T > void chkmax(T &x, const T &y) { x = x > y ? x : y; }
template < typename T > void chkmin(T &x, const T &y) { x = x < y ? x : y; }

const int N = 1e4 + 10;

int n, d[N], mat[N], ans[N];
vec G[N];
bool vis[N];

bool dfs(int x) {
	for(auto y : G[x])
		if(!vis[y]) {
			vis[y] = true;
			if(mat[y] == -1 || dfs(mat[y])) return mat[y] = x, true;
		}
	return false;
}

int main() {
#ifndef ONLINE_JUDGE
	freopen("1.in", "r", stdin);
#endif
	n = in; rep(i, 0, n - 1) d[i] = in;
	memset(mat, -1, sizeof mat);
	rep(i, 0, n - 1) {
		int a = i - d[i], b = i + d[i];
		if(a >= 0) G[i].eb(a);
		if(b < n) G[i].eb(b);
		d[i] = n - d[i];
		a = i - d[i], b = i + d[i];
		if(a >= 0) G[i].eb(a);
		if(b < n) G[i].eb(b);
		sort(G[i].begin(), G[i].end());
	}
	per(i, n - 1, 0) { memset(vis, 0, sizeof vis); if(!dfs(i)) return puts("No Answer"), 0; }
	rep(i, 0, n - 1) ans[mat[i]] = i;
	rep(i, 0, n - 1) printf("%d ", ans[i]); puts("");
	return 0;
}
